On cubic planes and groups connected with cubic varieties
نویسندگان
چکیده
منابع مشابه
Finite groups admitting a connected cubic integral bi-Cayley graph
A graph is called integral if all eigenvalues of its adjacency matrix are integers. Given a subset $S$ of a finite group $G$, the bi-Cayley graph $BCay(G,S)$ is a graph with vertex set $Gtimes{1,2}$ and edge set ${{(x,1),(sx,2)}mid sin S, xin G}$. In this paper, we classify all finite groups admitting a connected cubic integral bi-Cayley graph.
متن کاملCubic groups
Post-nonclassical intuitionistic “natural” arithmetic with its fundamental simplifications in the case of the problem of asymptotic distribution of primes is considered. It is showed that an existence of the cubic groups and n3th density of prime distribution are assuming an existence of the one-way function of the form f(x3) = y, fˉ1(y) =?x3.
متن کاملA Cubic Curve Connected with Two Triangles
/ = /i$i. Since (to)i = 5ii is in (s), and ni is prime to the order of Si, Si is a power of s. Thus h, as well as t, corresponds to t in the isomorphism of G with G/(s) ; but h and /' are of the same order tii. Every element of G/(s) whose order is a divisor of m/mi corresponds to an element of G whose order is a divisor of m. It follows that t', and hence every element of G/(s) whose order div...
متن کاملOn Domination in 2-Connected Cubic Graphs
In 1996, Reed proved that the domination number, γ(G), of every n-vertex graph G with minimum degree at least 3 is at most 3n/8 and conjectured that γ(H) ≤ dn/3e for every connected 3-regular (cubic) n-vertex graph H. In [1] this conjecture was disproved by presenting a connected cubic graph G on 60 vertices with γ(G) = 21 and a sequence {Gk} ∞ k=1 of connected cubic graphs with limk→∞ γ(Gk) |V...
متن کاملOn domination in connected cubic graphs
In 1996, Reed proved that the domination number (G) of every n-vertex graph G with minimum degree at least 3 is at most 3n/8.Also, he conjectured that (H) n/3 for every connected 3-regular (cubic) n-vertex graph H. In this note, we disprove this conjecture. We construct a connected cubic graph G on 60 vertices with (G) = 21 and present a sequence {Gk}∞k=1 of connected cubic graphs with lim k→∞ ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 1983
ISSN: 0021-8693
DOI: 10.1016/0021-8693(83)90011-x